Causal Discovery Algorithms based on Y Structures

نویسندگان

  • Subramani Mani
  • Gregory F. Cooper
چکیده

Discovering relationships of the form “A causally influences B” is valuable in different fields of study. These relationships are also referred to as “cause and effect” relationships where A represents the cause, and B denotes the effect. Generally, experimental studies are performed to ascertain causality where the value of a variable is set randomly and its effects measured under controlled experimental settings. However, such experiments may not be feasible due to logistical, ethical or cost considerations. We believe that discovery algorithms that can ascertain causality from observational (passively collected) data are valuable. The framework we use for causal discovery is founded on causal Bayesian networks. A causal Bayesian network (CBN) is a Bayesian network (BN) in which each arc is interpreted as a direct causal influence between a parent node (variable) and a child node, relative to the other nodes in the network (Pearl, 1991). For example, if there is a directed edge from A to B (A → B), node A is said to exert a causal influence on node B.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovering Knowledge from Medical Databases

We investigate new approaches for knowledge discovery from two medical databases. Two different kinds of knowledge, namely rules and causal structures, are learned. Rules capture interesting patterns and regularities in the database. Causal structures represented by Bayesian networks capture the causality relationships among the attributes. We employ advanced evolutionary algorithms for these d...

متن کامل

Local Causal Discovery of Direct Causes and Effects

We focus on the discovery and identification of direct causes and effects of a target variable in a causal network. State-of-the-art causal learning algorithms generally need to find the global causal structures in the form of complete partial directed acyclic graphs (CPDAG) in order to identify direct causes and effects of a target variable. While these algorithms are effective, it is often un...

متن کامل

Applying Evolutionary Algorithms to Discover Knowledge from Medical Databases

Data mining has become an important research topic. The increasing use of computer results in an explosion of information. These data can be best used if the knowledge hidden can be uncovered. Thus there is a need for a way to automatically discover knowledge from data. In this paper, new approaches for knowledge discovery from two medical databases are investigated. Two different kinds of know...

متن کامل

Measurement Error and Causal Discovery

Algorithms for causal discovery emerged in the early 1990s and have since proliferated [4, 10]. After directed acyclic graphical representations of causal structures (causal graphs) were connected to conditional independence relations (the Causal Markov Condition1 and dseparation2), graphical characterizations of Markov equivalence classes of causal graphs (patterns) soon followed, along with p...

متن کامل

SADA: A General Framework to Support Robust Causation Discovery with Theoretical Guarantee

Causation discovery without manipulation is considered a crucial problem to a variety of applications. The state-of-theart solutions are applicable only when large numbers of samples are available or the problem domain is sufficiently small. Motivated by the observations of the local sparsity properties on causal structures, we propose a general Split-and-Merge framework, named SADA, to enhance...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006